Batcher's odd-even exchange revisited: A generating functions approach
نویسنده
چکیده
The celebrated odd-even exchange algorithm by Batcher provides the quantity average number of exchanges, which was a mystery a few years ago and is still tricky today. We provide an approach that is purely based on generating functions to provide an explicit expression. The asymptotic analysis was done several years ago but never published in a journal and is thus provided here. It is a combination of singularity analysis of generating functions and Mellin transform techniques.
منابع مشابه
On Batcher's Merge Sorts as Parallel Sorting Algorithms
In this paper we examine the average running times of Batcher's bitonic merge and Batcher's odd-even merge when they are used as parallel merging algorithms. It has been shown previously that the running time of odd-even merge can be upper bounded by a function of the maximal rank diierence for elements in the two input sequences. Here we give an almost matching lower bound for odd-even merge a...
متن کاملOn the Average Running Time of Odd-Even Merge Sort
Trus paper is concerned with the average rUDDing time of Batcher's odd-even merge sort when implemented on a collection of processors. We consider the case where n, the size of the input, is an arbitrary multiple of the number p of processors used. We show that Batcher's odd-even merge (for two sorted lists of length n each) can be implemented to run in time O«nlp)(log(2 + p2 In))) on the avera...
متن کاملOdd-Even Sort in Powerlists
In 6] Misra introduced the powerlist notation and used it to succintly describe several parallel algorithms. In particular, algorithms that use a balanced divide and conquer strategy have elegant descriptions as powerlist functions. Among the examples presented were two sorting networks due to Batcher 1]. To prove their correctness a-posteriori, Misra used the 0-1 principle, which states that a...
متن کاملSOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED
Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...
متن کاملSorting Network Based Architectures for Median Filters
This paper presents sorting network based architectures for computing non-recursive and recursive median lters. The proposed architectures are highly pipelined, and consist of fewer compare-swap units than existing architectures. The reduction in the number of compare-swap units is achieved by minimizing computational overlap between successive outputs, and also by using Batcher's odd-even merg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 636 شماره
صفحات -
تاریخ انتشار 2016